%0 Conference Proceedings
%4 sid.inpe.br/sibgrapi/2012/07.06.13.25
%2 sid.inpe.br/sibgrapi/2012/07.06.13.25.27
%@doi 10.1109/SIBGRAPI.2012.15
%T An Efficient Algorithm for Fractal Analysis of Textures
%D 2012
%A Costa, Alceu Ferraz,
%A Humpire-Mamani, Gabriel,
%A Traina, Agma Juci Machado,
%@affiliation University of São Paulo, USP, Department of Computer Science
%@affiliation University of São Paulo, USP, Department of Computer Science
%@affiliation University of São Paulo, USP, Department of Computer Science
%E Freitas, Carla Maria Dal Sasso ,
%E Sarkar, Sudeep ,
%E Scopigno, Roberto ,
%E Silva, Luciano,
%B Conference on Graphics, Patterns and Images, 25 (SIBGRAPI)
%C Ouro Preto, MG, Brazil
%8 22-25 Aug. 2012
%I IEEE Computer Society
%J Los Alamitos
%S Proceedings
%K Fractal analysis, texture, feature extraction, content based image retrieval, image classification, image processing.
%X In this paper we propose a new and efficient texture feature extraction method: the Segmentation-based Fractal Texture Analysis, or SFTA. The extraction algorithm consists in decomposing the input image into a set of binary images from which the fractal dimensions of the resulting regions are computed in order to describe segmented texture patterns. The decomposition of the input image is achieved by the Two-Threshold Binary Decomposition (TTBD) algorithm, which we also propose in this work. We evaluated SFTA for the tasks of content-based image retrieval (CBIR) and image classification, comparing its performance to that of other widely employed feature extraction methods such as Haralick and Gabor filter banks. SFTA achieved higher precision and accuracy for CBIR and image classification. Additionally, SFTA was at least 3.7 times faster than Gabor and 1.6 times faster than Haralick with respect to feature extraction time.
%@language en
%3 PID2438001.pdf